package site.dovis.leetcode.q1304;

public class Solution {

    public int[] sumZero(int n) {
        int[] result = new int[n];

        for (int i = 0; i < n && i + 1 < n; i = i + 2) {
            result[i] = i + 1;
            result[i + 1] = -(i + 1);
        }

        return result;

    }
}
